#include <iostream>
#include <cstring>
using namespace std;
const int N=2010;
int T,n,a[N],sum[N],dp[N][N][2],ans,flag;
void dfs(int x,int s,int t,int ss,int f)
{
    //if(flag) return;
    int tp,s1,t1;
    if(f==1) tp=t;
    else tp=s;
    if(dp[x][tp][f]>ss) return;
    dp[x][tp][f]=ss;
    if(x==n+1){
            ans=max(ans,ss);
        return;
    }
    dfs(x+1,x,t,ss+(a[x]==a[s])*a[x],1);
    //if(flag) return;
    dfs(x+1,s,x,ss+(a[x]==a[t])*a[x],2);
}
int main()
{
    freopen("arena.in","r",stdin);
    freopen("arena.out","w",stdout);
    scanf("%d",&T);
    while(T--){
            cout<<"1"<<endl;
    }
    return 0;
}
